Competitive Algorithms for Distributed Data Management
نویسندگان
چکیده
منابع مشابه
Competitive Algorithms for Distributed Data Management
We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem ([DF], [ML]), where copies of a file may be be stored in the local storage of some subset of processors. Copies may be replicated and discarded over time so as to optimize communication costs, but multiple copies must be kept consistent and at least one co...
متن کاملCompetitive Algorithms for Distributed Data Management ( Draft )
We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the le allocation problem ((DF], ML]), where copies of a le may be be stored in the local storage of some subset of processors, copies may be replicated and discarded over time so as to optimize communication costs, but multiple copies must be kept consistent and at least one copy mu...
متن کاملCompetitive On-Line Algorithms for Distributed Data Management
Competitive on-line algorithms for data management in a network of processors are studied in this paper. A data object such as a file or a page of virtual memory is to be read and updated by various processors in the network. The goal is to minimize the communication costs incurred in serving a sequence of such requests. Distributed data management on important classes of networks—trees and bus...
متن کاملCompetitive Analysis of Distributed Algorithms
Most applications of competitive analysis have involved on-line problems where a candidate on-line algorithm must compete on some input sequence against an optimal oo-line algorithm that can in eeect predict future inputs. EEorts to apply competitive analysis to fault-tolerant distributed algorithms require accounting for not only this input nondeterminism but also system nondeterminism that ar...
متن کاملCompetitive Learning Algorithms for Data Clustering
This paper presents and discusses some competitive learning algorithms for data clustering. A new competitive learning algorithm, named the dynamically penalized rival competitive learning algorithm (DPRCL), is introduced and studied. It is a variant of the rival penalized competitive algorithm [1] and it performs appropriate clustering without knowing the clusters number, by automatically driv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1073